A Parallel Functional Language with First-Class Continuations. Programming Style and Semantics
نویسنده
چکیده
منابع مشابه
A Functional Abstraction of Typed Contexts
This report investigates abstracting control with functions. This is achieved by defining continuations as functions abstracting lexically a delimited context [C[ ]] rather than dynamically an unlimited one C[ ], as it is usually the case. Because their co-domain is distinguished from the final domain of Answers, such continuations can be composed, and this contrasts with the simple exceptions ...
متن کاملOn some Functional Aspects of Control
This paper points out and illustrates continuations as functions abstracting a delimited context instead of an unlimited one. When made available in an expression language, they provide a functional abstraction of control that can be used as any ordinary function. This approach sheds some light on the applicative aspects of continuations by getting rid of their imperative part: escaping. Contin...
متن کاملThe Theory and Practice of Programming Languages with Delimited Continuations
This dissertation presents a study of functional programming languages with first-class delimited continuations. We focus mainly on theoretical and practical aspects of Danvy and Filinski’s hierarchy of static delimited-control operators shiftn and resetn, and of Felleisen’s dynamic delimited-control operators control and prompt. Our study uses the traditional means of specifying semantics of f...
متن کاملFirst Class Messages as First Class Continuations
First class messages, which we call message continuations, provide object-oriented concurrent programming languages with extensibility in modeling and programming communication schemes such as asynchronous communication, multicasting, sophisticated synchronization constraints, interobject synchronization, concurrency control, resource management, and so on. In spite of its powerful extensibilit...
متن کاملGNU epsilon - an extensible programming language - Luca Saiu's PhD thesis
Abstract Reductionism is a viable strategy for designing and implementing practical programming languages, leading to solutions which are easier to extend, experiment with and formally analyze. We formally specify and implement an extensible programming language, based on a minimalistic first-order imperative core language plus strong abstraction mechanisms, reflection and self-modification fea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers and Artificial Intelligence
دوره 14 شماره
صفحات -
تاریخ انتشار 1995